The Semantic Score Approach to the Disambiguation of PP Attachment Problem

نویسندگان

  • Chao-Lin Liu
  • Jing-Shin Chang
  • Keh-Yih Su
چکیده

In a Natural Language Processing System which takes English as the source input language , the syntactic roles of the prepositional phrases in a sentence are difficult to identify. A large number of ambiguities may result from these phrases. Traditional rule-based approaches to this problem rely heavily on general linguistic knowledge, complicated knowledge bases and sophisticated control mechanism. When uncertainty about the attachment patterns is encountered , some heuristics and ad hoc procedures are adopted to assign attachment preference for disambiguation. Hence, although the literatures about this topic are abundant, there is no guarantee of the objectiveness and optimality of these approaches. In this paper, a probabilistic semantic model is proposed to resolve the PP attachment problem without using complicated knowledge bases and control mechanism. This approach elegantly integrates the linguistic model for semantics interpretation and the objective characteristics of the probabilistic Semantic Score model. Hence, it will assign a much more objective preference measure to each ambiguous attachment pattern. It is found that approximately 90% of the PP attachment problem in computer manuals can be solved with this approach without resorting to any heuristics-based rules and complicated control mechanism. The mapping between the abstract Score Function paradigm and the real PP attachment problem will be addressed in this paper. Future expansion of the semantic score function for resolving general ambiguity problems is also suggested.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Disambiguation of Prepositional Phrase Attachment and Interpretation

In this paper, a hybrid disambiguation method for the prepositional phrase (PP) attachment and interpretation problem is presented. 1 The data needed, semantic PP interpretation rules and an annotated corpus, is described first. Then the three major steps of the disambiguation method are: explained. Cross-validated evaluation results', for German (88.6-94.4% correct for binary attachment ambigu...

متن کامل

Prepositional Phrase Attachment through Semantic Association using Connectionist Approach

Determining the correct attachment site for Prepositional Phrase (PP) is one of the major sources of ambiguity in natural language parsing and analysis. In this paper, we describe a neural network based approach to prepositional phrase attachment for natural language text. Our approach disambiguates the attachment site for PP through semantic association among the constituents namely verb, noun...

متن کامل

Improving Parsing and PP Attachment Performance with Sense Information

To date, parsers have made limited use of semantic information, but there is evidence to suggest that semantic features can enhance parse disambiguation. This paper shows that semantic classes help to obtain significant improvement in both parsing and PP attachment tasks. We devise a gold-standard senseand parse tree-annotated dataset based on the intersection of the Penn Treebank and SemCor, a...

متن کامل

A Connectionist Approach to Propositional Phrase Attachment for Real World Texts

Ill this paper we describe a neural network-based approach to prepositional phrase attachment disam-biguation for real world texts. Although the use of semantic classes in this task seems intuitively to be adequate, methods employed to date have not used them very effectively. Causes of their poor results are discussed. Our model, which uses only classes, scores appreciably better than the othe...

متن کامل

Corpus Based PP Attachment Ambiguity Resolution with a Semantic Dictionary

This paper deals with two important ambiguities of natural language: prepositional phrase attachment and word sense ambiguity. We propose a new supervised learning method for PPattachment based on a semantically tagged corpus. Because any sufficiently big sense-tagged corpus does not exist, we also propose a new unsupervised context based word sense disambiguation algorithm which amends the tra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1990